The Temporal Winner-Take-All Readout
نویسندگان
چکیده
منابع مشابه
The Temporal Winner-Take-All Readout
How can the central nervous system make accurate decisions about external stimuli at short times on the basis of the noisy responses of nerve cell populations? It has been suggested that spike time latency is the source of fast decisions. Here, we propose a simple and fast readout mechanism, the temporal Winner-Take-All (tWTA), and undertake a study of its accuracy. The tWTA is studied in the f...
متن کاملWinner-Take-All Autoencoders
In this paper, we propose a winner-take-all method for learning hierarchical sparse representations in an unsupervised fashion. We first introduce fully-connected winner-take-all autoencoders which use mini-batch statistics to directly enforce a lifetime sparsity in the activations of the hidden units. We then propose the convolutional winner-take-all autoencoder which combines the benefits of ...
متن کاملExploiting Spatio-Temporal Structure with Recurrent Winner-Take-All Networks
We propose a convolutional recurrent neural network, with Winner-Take-All dropout for high dimensional unsupervised feature learning in multi-dimensional time series. We apply the proposedmethod for object recognition with temporal context in videos and obtain better results than comparable methods in the literature, including the Deep Predictive Coding Networks previously proposed by Chalasani...
متن کاملWinner-take-all price competition
This paper examines the competitiveness of winner-take-all price competition in homogeneous product oligopoly environments where underlying buyer demands and/or firms’ costs need not be continuous. Our analysis is motivated by the observation that a variety of economic settings have these features. For example, in 1996 an Ivy League university solicited bids from several vendors for its initiat...
متن کاملWinner-Take-All EM Clustering
The EM algorithm is often used with mixture models to cluster data, but for efficiency reasons it is sometimes desirable to produce hard clusters. Several hard clustering limits of EM are known. For example, k-means clustering can be derived from EM in a Gaussian mixture model by taking the limit of all variances going to zero. We present a new method of deriving Winner-Take-All versions of EM ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PLoS Computational Biology
سال: 2009
ISSN: 1553-7358
DOI: 10.1371/journal.pcbi.1000286